// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
struct node
{
	int b,d;
};
signed main()
{
	int t=1;
//	cin>>t;
	while(t--)
	{
		int n,ans=0;
		cin>>n;
		vector<node> v(n+1);
		for(int i=1;i<=n;i++)
		{
			cin>>v[i].b;
			v[i].d=i;
		}
		for(int i=1;i<=n-1;i++)
		{
			if(v[i].b==v[i].d)continue;
			for(int j=i+1;j<=n;j++)
			{
				if(v[i].d==v[j].b)
				{
					ans++;
					int tmp=v[i].b;
					v[i].b=v[j].b;
					v[j].b=tmp;
				}
			}
		}
		cout<<ans;
	}
	return 0;
}
